Stabilizing Linear MPC with Efficient Prioritized Infeasibility Handling
نویسندگان
چکیده
منابع مشابه
Stabilizing Linear Mpc with Efficient Prioritized Infeasibility Handling
In order to minimize the number of situations when a model predictive controller fails to compute a control input, all practical MPC implementations should have a means to recover from infeasibility. We present a recently developed infeasibility handler which computes optimal relaxations of the relaxable constraints subject to a user-de ned prioritization. This infeasibility handler requires th...
متن کاملInfeasibility Handling in Linear Mpc Subject to Prioritized Constraints
All practical MPC implementations should have a means to recover from infeasibility. We propose an algorithm designed for linear state-space MPC which transforms an infeasible MPC optimization problem into a feasible one. The algorithm handles possible prioritizations among the constraints explicitly. Prioritized constraints can be seen as an intuitive and structural way to impose process knowl...
متن کاملLinear MPC with optimal prioritized infeasibility handling: application, computational issues and stability
All practical MPC implementations should have a means to recover from infeasibility. We present a recently developed infeasibility handler which computes optimal relaxations of the relaxable constraints subject to a user-de ned prioritization, by solving only a single linear program on-line in addition to the standard quadratic programming problem on-line. A stability result for this infeasibil...
متن کاملStabilizing polynomial approximation of explicit MPC
A given explicit piecewise affine representation of an MPC feedback law is approximated by a single polynomial, computed using linear programming. This polynomial state feedback control law guarantees closed-loop stability and constraint satisfaction. The polynomial feedback can be implemented in real time even on very simple devices with severe limitations on memory storage.
متن کاملmpC + ScaLAPACK = Efficient Solving Linear Algebra Problems on Heterogeneous Networks
The paper presents experience of using mpC for accelerating ScaLAPACK applications on heterogeneous networks of computers. The mpC is a language, specially designed for parallel programming for heterogeneous networks. It has facilities for distribution of participating processes over processors in accordance with performances of the latters. An mpC application carring out Cholesky factorization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2000
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)38556-7